Improved Balas and Mazzola Linearization for Quadratic 0-1 Programs with Application in a New Cutting Plane Algorithm
نویسنده
چکیده
Balas and Mazzola linearization (BML) is widely used in devising cutting plane algorithms for quadratic 0-1 programs. In this article, we improve BML by first strengthening the primal formulation of BML and then considering the dual formulation. Additionally, a new cutting plane algorithm is proposed.
منابع مشابه
A lift-and-project cutting plane algorithm for mixed 0-1 programs
We propose a cutting plane algorithm for mixed 0-1 programs based on a family of polyhedra which strengthen the usual LP relaxation. We show how to generate a facet of a polyhedron in this family which is most violated by the current fractional point. This cut is found through the solution of a linear program that has about twice the size of the usual LP relaxation. A lifting step is used to re...
متن کاملSolving Standard Quadratic Programming by Cutting Planes
Standard quadratic programs are non-convex quadratic programs with the only constraint that variables must belong to a simplex. By a famous result of Motzkin and Straus, those problems are connected to the clique number of a graph. In this paper, we study cutting plane techniques to obtain strong bounds for standard quadratic programs. Our cuts are derived in the context of a Spatial Branch & B...
متن کاملA new linearization method for quadratic assignment problems
The quadratic assignment problem (QAP) is one of the great challenges in combinatorial optimization. Linearization for QAP is to transform the quadratic objective function into a linear one. Numerous QAP linearizations have been proposed, most of which yield mixed integer linear programs (MILP). Kauffmann and Broeckx’s linearization (KBL) is the current smallest one in terms of the number of va...
متن کاملCutting planes for RLT relaxations of mixed 0-1 polynomial programs
The Reformulation-Linearization Technique (RLT), due to Sherali and Adams, can be used to construct hierarchies of linear programming relaxations of mixed 0-1 polynomial programs. As one moves up the hierarchy, the relaxations grow stronger, but the number of variables increases exponentially. We present a procedure that generates cutting planes at any given level of the hierarchy, by optimally...
متن کاملStronger Cuts from Weaker Disjunctions
We discuss an enhancement of the Balas-Jeroslow procedure for strengthening disjunctive cuts for mixed 0-1 programs. It is based on the paradox that sometimes weakening a disjunction helps the strengthening procedure and results in sharper cuts. When applied to a split cut derived from a source row of the simplex tableau, the enhanced procedure yields, besides the Gomory Mixed Integer cut (GMI)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1204.4829 شماره
صفحات -
تاریخ انتشار 2012